Parallel Boundary Elements Using Lapack and ScaLapack
نویسندگان
چکیده
The present work introduces the main steps towards the parallelization of existing Boundary Element Method (BEM) codes using available standard and portable libraries for writing parallel programs, such as LAPACK and ScaLAPACK. Here, a well-known BEM Fortran implementation is reviewed and rewritten to run on shared and distributed memory systems. This effort is the initial step to develop a new generation of parallel BEM codes to be used in many important engineering problems. Numerical experiments on a SGI Origin 2000 show the effectiveness of the proposed approach.
منابع مشابه
Implementing Communication-optimal Parallel and Sequential Qr Factorizations
We present parallel and sequential dense QR factorization algorithms for tall and skinny matrices and general rectangular matrices that both minimize communication, and are as stable as Householder QR. The sequential and parallel algorithms for tall and skinny matrices lead to significant speedups in practice over some of the existing algorithms, including LAPACK and ScaLAPACK, for example up t...
متن کاملSNAP (Small-World Network Analysis and Partitioning) Framework
Discussion Both LAPACK and ScaLAPACK libraries contain routines for solving systems of linear equations, least squares problems, and eigenvalue problems. The goals of both projects are efficiency (to run as fast as possible), scalability (as the problem size and number of processors grow), reliability (including error bounds), portability (across all important parallel machines), flexibility (s...
متن کاملPorting a sphere optimization program from LAPACK to ScaLAPACK
The sphere optimization program sphopt was originally written as a sequential program using lapack, and was converted to use scalapack, primarily to overcome memory limitations. The conversion was relatively straightforward, using a small number of organizing principles which are widely applicaple to the scalapack parallelization of serial code. The main innovation is the use of a compressed bl...
متن کاملA Cholesky Algorithm for Some Complex Symmetric Systems
Complex symmetric systems do not in general admit a Cholesky factorization without pivoting, as would be the case for hermitian systems. Nevertheless, for some complex symmetric systems, as those coming from the discretization of boundary integral formulations, pivoting can be avoided. We present a Cholesky factorization algorithm for such complex symmetric systems. We propose a LAPACK-style im...
متن کاملCommunication-optimal Parallel and Sequential QR and LU Factorizations
We present parallel and sequential dense QR factorization algorithms that are both optimal (up to polylogarithmic factors) in the amount of communication they perform and just as stable as Householder QR. We prove optimality by deriving new lower bounds for the number of multiplications done by “non-Strassen-like” QR, and using these in known communication lower bounds that are proportional to ...
متن کامل